/cody/pratham0709/Striver-A-TO-Z-SDE-SHEET/Strings/Basic%20and%20Easy%20String%20Problems/Maximum%20Nesting%20Depth%20Of%20The%20Parentheses.cpp
int maxDepth(string s) {
// Write your code here.
int n = s.length();
int count;
int close;
int maxi = 0;
for(int i =0; i<n; i++){
if(s[i] == '('){
count ++;
}
maxi= max(count,maxi);
if(s[i] == ')'){
count--;
}
}
if(count == close){
return maxi;
}
}